/*
 * p10341.cpp
 *
 *  Created on: 2013-10-25
 *      Author: zy
 */
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#define F(x) (p*exp(-x)+q*sin(x)+r*cos(x)+s*tan(x)+t*(x)*(x)+u)
const double eps = 1e-14;
using namespace std;
int main()
{
	int p, r, q, s, t, u;
	while (scanf("%d%d%d%d%d%d", &p, &q, &r, &s, &t, &u) == 6)
	{
		double f0 = F(0), f1 = F(1);
		if (f0 < -eps || f1 > eps)
			puts("No solution");
		else
		{
			double x = 0, y = 1, m;
			for (int i = 0; i < 100; i++)
			{
				m = x + (y - x) / 2;
				if (F(m) < 0)
					y = m;
				else
					x = m;
			}
			printf("%0.4lf\n", m);
		}
	}
	return 0;
}
